A fundamental tool in statistical mechanics and probabilistic combinatorics (especially random graphs and the probabilistic method), the Ahlswede–Daykin inequality (Rudolf Ahlswede & David E. Daykin 1978) is a correlation-type inequality for four functions on a finite distributive lattice.
It states that if ƒi, i = 1, 2, 3, 4 are positive functions on a finite distributive lattice such that
for all x, y in the lattice, then
for all subsets X, Y of the lattice, where
and
It implies the Holley inequality, which in turn implies the FKG inequality. It also implies the Fishburn–Shepp inequality.
For a proof, see the original article (Ahlswede & Daykin 1978) or Alon & Spencer (2000).